Comments on “An Arithmetic Free Parallel Mixed-Radix Conversion Algorithm” Submitted to IEEE Trans. Circuits and Systems
نویسندگان
چکیده
In a recently published paper “An Arithmetic Free Parallel Mixed-Radix Conversion Algorithm”, two algorithms based on look-up tables for mixed-radix conversion are presented. Here we show that one of the algorithms had been prior published in 1978, and we also take this opportunity to speak to the use of look-up tables for RNS with present and future technologies.
منابع مشابه
Comments on " an Arithmetic Free Parallel Mixed-radix Conversion Algorithm "
In the above paper, two algorithms based on look-up tables for mixed-radix conversion are presented. Here, we show that one of the algorithms had been previously published in 1978, and we also take this opportunity to speak of the use of look-up tables for the residue number system with present and future technologies.
متن کاملLow Complexity Converter for the Moduli Set {2^n+1,2^n-1,2^n} in Two-Part Residue Number System
Residue Number System is a kind of numerical systems that uses the remainder of division in several different moduli. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers will increase the speed of the arithmetic operations in this system. However, the main factor that affects performance of system is hardware complexity of reverse converter. Reverse co...
متن کاملA Number System with Continuous Valued Digits and Modulo Arithmetic
This paper presents a novel number system based on signed continuous valued digits. Arithmetic operations in this number system are performed using simple analog circuitry, in contrast to the conventional implementation of arithmetic units by Boolean or multiple-valued logic circuits. Unlike the limited precision offered by classical analog arithmetic circuits, the ensemble of continuous valued...
متن کاملAn Algorithm for Magnitude Comparison in RNS based on Mixed-Radix Conversion II
The residue number system (RNS) has computational advantages for large integer arithmetic because of its parallel carry free, and high-speed arithmetic nature. However, magnitude comparison is a very complex operation for RNS. This paper presents a new comparison algorithm based on the modification of Mixed-Radix Conversion II technique. The new algorithm uses small modulo operations only and h...
متن کاملRadix-2r Arithmetic for Multiplication by a Constant
In this paper, radix-2 arithmetic is explored to minimize the number of additions in the multiplication by a constant. We provide the formal proof that for an N-bit constant, the maximum number of additions using radix-2 is lower than Dimitrov’s estimated upper-bound (2.N/log(N)) using double base number system (DBNS). In comparison to canonical signed digit (CSD) and DBNS, the new radix-2 reco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998